Counting Distinct Strings
نویسندگان
چکیده
منابع مشابه
COUNTING DISTINCT FUZZY SUBGROUPS OF SOME RANK-3 ABELIAN GROUPS
In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملCounting Suffix Arrays and Strings
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix arrays and their enumeration. For fixed alphabet size and string length we count the number of strings sharing the same suffix array and the number of such suffix arrays. Our methods have applications to...
متن کاملCounting Colours in Compressed Strings
Suppose we are asked to preprocess a string s[1..n] such that later, given a substring’s endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes nH0(s)+O(n) + o(nH0(s)) bits, where H0(s) is the 0th-order empirical entropy of s, and answers queries in O (
متن کاملCounting Dependent and Independent Strings
We derive quantitative results regarding sets of n-bit strings that have different dependency or independency properties. Let C(x) be the Kolmogorov complexity of the string x. A string y has α dependency with a string x if C(y) − C(y | x) ≥ α. A set of strings {x1, . . . , xt} is pairwise α-independent if for all i 6= j, C(xi) − C(xi | xj) ≤ α. A tuple of strings (x1, . . . , xt) is mutually α...
متن کاملcounting distinct fuzzy subgroups of some rank-3 abelian groups
in this paper we classify fuzzy subgroups of a rank-3 abelian group $g = mathbb{z}_{p^n} + mathbb{z}_p + mathbb{z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. we present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1999
ISSN: 0178-4617
DOI: 10.1007/pl00009247